Part 1 . Discrete Problems Problems and Results in Combinatorial Geometry °

نویسنده

  • Hugo Hadwiger
چکیده

I have published during my very long life many papers with similar titles . In this note, I report on progress made on some of the old problems and discuss also some new ones, and I repeat some old problems which seem to have been forgotten by everybody (sometimes including myself) . First, a very incomplete list is given of some papers dealing with these and related questions . I have published three survey papers on this subject [1-3] . I want to call attention to the excellent book of Hadwiger and Debrunner which originally appeared in German and French . This book was translated by Klee who also added much original material and brought the book up-to-date (up to about 1964) [4] . This book contains a great deal of interesting material and can be used as a textbook to learn the subject, but contains few unsolved problems . (Unfortunately, it is out of print .) A very fruitful source of problems and results is the much expanded 1981 edition of W. Moser's collection, "Research Problems in Discrete Geometry" (McGill University) . The nucleus of this collection was the old problems of the late Leo Moser . In Elemente der Mathematik there is a section entitled "Ungelőste Probleme" which was edited by Hadwiger and in the American Mathematical Monthly there is a similar section edited by Guy ; both often contain geometrical problems . See also the papers by Fejes-Toth, Grünbaum, and Klee that are quoted in [1] . G. Purdy and I plan to write a book on various problems in combinatorial geometry . We hope the book will appear in this decade .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modified particle swarm optimization algorithm to solve location problems on urban transportation networks (Case study: Locating traffic police kiosks)

Nowadays, traffic congestion is a big problem in metropolises all around the world. Traffic problems rise with the rise of population and slow growth of urban transportation systems. Car accidents or population concentration in particular places due to urban events can cause traffic congestions. Such traffic problems require the direct involvement of the traffic police, and it is urgent for the...

متن کامل

Research Statement Jeong -

My research interests lie in Discrete Mathematics, especially Combinatorics, Graph Theory, Combinatorial Geometry, and Combinatorial Number Theory. For me, the most exciting aspect of working in discrete mathematics is the prevalence of combinatorial problems in various fields of mathematics and various applications to Computer Science and real life problems such as building transmitters in a t...

متن کامل

Jeong - Hyun

My research interests lie in Discrete Mathematics, especially Combinatorics, Graph Theory, Combinatorial Geometry, and Combinatorial Number Theory. For me, the most exciting aspect of working in discrete mathematics is the prevalence of combinatorial problems in various fields of mathematics and various applications to Computer Science and real life problems such as building transmitters in a t...

متن کامل

A Discrete Singular Convolution Method for the Seepage Analysis in Porous Media with Irregular Geometry

A novel discrete singular convolution (DSC)  formulation  is  presented for the seepage analysis in irregular geometric porous media. The DSC is a new promising numerical approach which has been recently applied to solve several engineering problems. For a medium with regular geometry, realizing of the DSC for the seepage analysis is straight forward. But DSC implementation for a medium with ir...

متن کامل

PERFORMANCE COMPARISON OF CBO AND ECBO FOR LOCATION FINDING PROBLEMS

The p-median problem is one of the discrete optimization problem in location theory which aims to satisfy total demand with minimum cost. A high-level algorithmic approach can be specialized to solve optimization problem. In recent years, meta-heuristic methods have been applied to support the solution of Combinatorial Optimization Problems (COP). Collision Bodies Optimization algorithm (CBO) a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1985